Separation with streams in the Λμ-calculus
نویسنده
چکیده
The λμ-calculus is an extension of the λ-calculus introduced in 1992 by Parigot [17] in order to generalize the Curry-Howard isomorphism to classical logic. Two versions of the calculus are usually considered in the literature: Parigot’s original syntax and an alternative syntax introduced by de Groote. In 2001, David and Py [5] proved that the Separation Property (also referred to as Böhm theorem) fails for Parigot’s λμ-calculus. By analyzing David & Py’s result, we exhibit an extension of Parigot’s λμ-calculus, the Λμ-calculus, for which the Separation Property holds and which is built as an intermediate language between Parigot’s and de Groote’s λμ-calculi. We prove the theorem and describe how Λμcalculus can be considered as a calculus of terms and streams. We then illustrate Separation in showing how in Λμ-calculus it is possible to separate the counter-example
منابع مشابه
Typing streams in the Λμ-calculus: extended abstract
Λμ-calculus [11] has been built as an untyped extension of the λμ-calculus [10] in order to recover Böhm theorem which was known to fail in λμ-calculus since a result by David & Py [2]. An essential computational feature of Λμ-calculus for separation to hold is the unrestricted use of abstractions over continuation variables that provides the calculus with a construction of streams. In [11], Λμ...
متن کاملStandardization and Böhm trees for Λμ-calculus
Λμ-calculus is an extension of Parigot's λμ-calculus which (i) satis es Separation theorem: it is Böhm-complete, (ii) corresponds to CBN delimited control and (iii) is provided with a stream interpretation. In the present paper, we study solvability and investigate Böhm trees for Λμ-calculus. Moreover, we make clear the connections between Λμcalculus and in nitary λ-calculi. After establishing ...
متن کاملλμ-calculus and Λμ-calculus: a Capital Difference
Since Parigot designed the λμ-calculus to algorithmically interpret classical natural deduction, several variants of λμ-calculus have been proposed. Some of these variants derived from an alteration of the original syntax due to de Groote, leading in particular to the Λμ-calculus of the second author, a calculus truly different from λμ-calculus since, in the untyped case, it provides a Böhm sep...
متن کاملOn the Relations between the Syntactic Theories of lambda-mu-Calculi
Since Parigot's seminal article on an algorithmic interpretation of classical natural deduction [13], λμ-calculus has been extensively studied both as a typed and an untyped language. Among the studies about the call-by-name lambda-mu-calculus authors used di erent presentations of the calculus that were usually considered as equivalent from the computational point of view. In particular, most ...
متن کاملA foundational calculus for computing with streams
Computing with streams is a topic of increasing interest in modern computer science. Several proposals have suggested the use of programming languages and rewriting systems in order to formally describe programs computing over stream data. However, no stream calculus (in the sense of λ-calculus) has been exhibited for such studies yet. The challenge of providing a calculus for streams is to mak...
متن کامل